Testing Expressibility Is Hard
نویسنده
چکیده
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of examples, that the standard witnesses to expressibility and inexpressibility (gadgets/formulas/conjunctive queries and polymorphisms respectively) may be required to be exponentially larger than the instances. We also show that the full expressibility problem is co-NEXPTIME-hard. Our proofs hinge on a novel interpretation of a tiling problem into the expressibility problem.
منابع مشابه
Expressibility of Valued Constraints
In this paper we present a project on the expressibility of valued constraints. We recall the result of Cohen et al. [2] which characterises the expressibility of valued constraints in terms of algebraic properties of the constraints. We show why the current algebraic characterisation is rather unsatisfactory and what are the ways we try to explore in order to find a better one.
متن کاملMathematical Expressibility, Perceptual Relativity, and Secondary Qualities
During the seventeenth century, several apparently very disparate reasons were advanced for a believing that there is an important distinction between primary and secondary qualities. The most prominent were (1) the overall explanatory success of a physical science which refers only to primary qualities (2) the mathematical expressibility of primary but not secondary qualities, and (3) the immu...
متن کاملTowards a Positive Query Language for RDF
When querying incomplete databases, the possibility of optionally obtaining information -when availableis a distinctive feature. In particular, this feature is present in SPARQL, the language recommended by the W3C for querying Semantic Web data. Unfortunately, its implementation has been shown to have adverse consequences. Two of the most notable are an increase in evaluation complexity and th...
متن کاملOn the Complexity of Consistent Query Answering in the Presence of Simple Ontologies
Consistent query answering is a standard approach for producing meaningful query answers when data is inconsistent. Recent work on consistent query answering in the presence of ontologies has shown this problem to be intractable in data complexity even for ontologies expressed in lightweight description logics. In order to better understand the source of this intractability, we investigate the ...
متن کاملAssessment of Auditory Skills of Children who are Deaf and Hard of Hearing
Background: An integral part of a comprehensive auditory training program is the assessment of individual auditory skills. In addition, most therapists will want to evaluate the hearing ability of their pupils in a more formal manner and in approximately the same way and comparing their auditory abilities to regroup them for communication activities. Conclusion: Evaluation and informal observa...
متن کامل